Conditioning Properties of the LLL Algorithm
نویسندگان
چکیده
Although the LLL algorithm was originally developed for lattice basis reduction, the method can also be used to reduce the condition number of a matrix. In this paper, we propose a pivoted LLL algorithm that further improves the conditioning. Our experimental results demonstrate that this pivoting scheme works well in practice.
منابع مشابه
A modified LLL algorithm for change of ordering of Grobner basis
In this paper, a modied version of LLL algorithm, which is a an algorithm with output-sensitivecomplexity, is presented to convert a given Grobner basis with respect to a specic order of a polynomialideal I in arbitrary dimensions to a Grobner basis of I with respect to another term order.Also a comparison with the FGLM conversion and Buchberger method is considered.
متن کاملN-Dimensional LLL Reduction Algorithm with Pivoted Reflection
The Lenstra-Lenstra-Lovász (LLL) lattice reduction algorithm and many of its variants have been widely used by cryptography, multiple-input-multiple-output (MIMO) communication systems and carrier phase positioning in global navigation satellite system (GNSS) to solve the integer least squares (ILS) problem. In this paper, we propose an n-dimensional LLL reduction algorithm (n-LLL), expanding t...
متن کاملProviding a Bird Swarm Algorithm based on Classical Conditioning Learning Behavior and Comparing this Algorithm with sinDE, JOA, NPSO and D-PSO-C Based on Using in Nanoscience
There can be no doubt that nanotechnology will play a major role in our futuretechnology. Computer science offers more opportunities for quantum andnanotechnology systems. Soft Computing techniques such as swarm intelligence, canenable systems with desirable emergent properties. Optimization is an important anddecisive activity in structural designing. The inexpensive re...
متن کاملNumerical Properties of the LLL Algorithm
The LLL algorithm is widely used to solve the integer least squares problems that arise in many engineering applications. As most practitioners did not understand how the LLL algorithm works, they avoided the issue by referring to the method as an integer Gram Schmidt approach (without explaining what they mean by this term). Luk and Tracy were first to describe the behavior of the LLL algorith...
متن کاملThe Algorithmic LLL and the Witness Tree Lemma
We consider the recent works of [3, 31, 2] that provide tools for analyzing focused stochastic local search algorithms that arise from algorithmizations of the Lovász Local Lemma [17] (LLL) in general probability spaces. These are algorithms which search a state space probabilistically by repeatedly selecting a “flaw” that is currently present and moving to a random nearby state in an effort to...
متن کامل